On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems
نویسندگان
چکیده
In this paper1 we study the on-line version of maximum-weighted hereditary subgraph problems. In our on-line model, the final instance (a graph with n vertices) is revealed in t clusters, n t ≤ ≤ 2 . We first focus on an on-line version of the maximumweighted hereditary subgraph problem. Then, we deal with the particular case of the independent set problem. We are interested in two types of results: the competitive ratio guaranteed by the on-line algorithm and hardness results that account for the difficulty of the problems and for the quality of algorithms developed to solve them.
منابع مشابه
Reoptimization of maximum weight induced hereditary subgraph problems
The reoptimization issue studied in this paper can be described as follows: given an instance I of some problem Π, an optimal solution OPT for Π in I and an instance I ′ resulting from a local perturbation of I that consists of insertions or removals of a small number of data, we wish to use OPT in order to solve Π in I , either optimally or by guaranteeing an approximation ratio better than th...
متن کامل[Proceeding] Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems
The reoptimization issue studied in this paper can be described as follows: given aninstance I of some problem Π, an optimal solution OPT for Π in I and an instance I ′ resultingfrom a local perturbation of I that consists of insertions or removals of a small number ofdata, we wish to use OPT in order to solve Π in I , either optimally or by guaranteeingan approximation ratio be...
متن کاملReoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems
The reoptimization issue studied in this paper can be described as follows: given aninstance I of some problem Π, an optimal solution OPT for Π in I and an instance I ′ resultingfrom a local perturbation of I that consists of insertions or removals of a small number ofdata, we wish to use OPT in order to solve Π in I , either optimally or by guaranteeingan approximation ratio be...
متن کاملApproximations via Partitioning
We consider the approximation of weighted maximum subgraph problems by partitioning the input graph into easier subproblems. In particular, we obtain efficient approximations of the weighted independent set problem with performance ratios of O(n(log log n/ log n)) and (∆ + 2)/3, with the latter improving on a ∆/2 ratio of Hochbaum for ∆ ≥ 5. We also obtain a O(n/ log n) performance ratio for va...
متن کاملOn-line maximum-order induced hereditary subgraph problems (Preliminary version)
We first study the competitivity ratio for the on-line version of the problem of finding a maximum-order induced subgraph satisfying some hereditary property, under the hypothesis that the input graph is revealed by clusters. Then, we focus ourselves on two of the most known instantiations of this problem, the maximum independent set and the maximum clique.
متن کامل